A Revised Su cient Condition for Backtrack-Free Search
نویسندگان
چکیده
In this paper, we deene the notion of !-consistency and !-graph associated with general n-ary constraint satisfaction problems and present an alternative suu-cient condition for backtrack-free search; that is, if the hypergraph associated with a general CSP has a tree-structured !-graph, then enforcing !-consistency enables the CSP to be solved by search without backtracking. We then show that the subclass of tractable CSPs identiied with the new condition contains the subclass of tractable CSPs identiied previously.
منابع مشابه
Constraint Restrictiveness versus Local and Global Consistency
Constraint networks are a simple representation and reasoning framework with diverse applications. In this paper, we identify two new complementary properties on the restrictiveness of the constraints in a network| constraint tightness and constraint looseness|and we show their usefulness for estimating the level of local consistency needed to ensure global consistency, and for estimating the l...
متن کاملBacktrack-Free Search for Resource Allocation Problems
Freuder 9] has previously given conditions that guarantee backtrack-free search when solving binary constraint networks. Freuder's condition relies on the \width" of the constraint network. Computing the width of a constraint network involves minimizing over all possible orderings of the vertices in the network. This paper presents an similar result for backtrack-free search when solving resour...
متن کاملOn the Inherent Level of Local Consistency in Constraint Networks
We present a new property called constraint loose ness and show how it can be used to estimate the level of local consistency of a binary constraint net work Speci cally we present a relationship between the looseness of the constraints the size of the do mains and the inherent level of local consistency of a constraint network The results we present are useful in two ways First a common method...
متن کاملConstraint Tightness versus Global Consistency
Constraint networks are a simple represen tation and reasoning framework with diverse applications In this paper we present a new property called constraint tightness that can be used for characterizing the di culty of problems formulated as constraint networks Speci cally we show that when the con straints are tight they may require less pre processing in order to guarantee a backtrack free so...
متن کاملA Confluent Connection Calculus
This work is concerned with basic issues of the design of calculi and proof procedures for first-order connection methods and tableaux calculi. Proof procedures for these type of calculi developed so far suffer from not exploiting proof confluence, and very often unnecessarily rely on a heavily backtrack oriented control regime. As a new result, we present a variant of a connection calculus and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997